A repertoire for additive functionals of uniformly distributed m - ary search trees ( Extended Abstract )
نویسندگان
چکیده
Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on m-ary search trees on n keys with toll sequence (i) n with α ≥ 0 (α = 0 and α = 1 correspond roughly to the space requirement and total path length, respectively); (ii) ln ` n m−1 ́ , which corresponds to the so-called shape functional; and (iii) 1n=m−1, which corresponds to the number of leaves.
منابع مشابه
A REPERTOIRE FOR ADDITIVE FUNCTIONALS OF UNIFORMLY DISTRIBUTED m-ARY SEARCH TREES
Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on m-ary search trees on n keys with toll sequence (i) nα with α ≥ 0 (α = 0 and α = 1 correspond roughly to the space requirement and total path length, respectively); (ii) ln ( n m−1 ) , which corresponds to the socalled shape functional; and...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملAdditive functionals on multiway search trees
We derive asymptotics of moments and limiting distributions, under the random permutation model on m-ary search trees on n keys, of functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the socalled shape functional fall under this framework. The limiting behavior of these functionals exhibi...
متن کاملADDITIVE FUNCTIONALS OF d-ARY INCREASING TREES
A tree functional is called additive if it satisfies a recursion of the form F (T ) = ∑k j=1 F (Bj)+f(T ), where B1, . . . , Bk are the branches of the tree T and f(T ) is a toll function. We prove a general central limit theorem for additive functionals of d-ary increasing trees under suitable assumptions on the toll function. The same method also applies to generalised planeoriented increasin...
متن کاملTransfer theorems and asymptotic distributional results for m-ary search trees
We derive asymptotics of moments and identify limiting distributions, under the random permutation model onm-ary search trees, for functionals that satisfy recurrence relations of a simple additive form. Many important functionals including the space requirement, internal path length, and the so-called shape functional fall under this framework. The approach is based on establishing transfer th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005